منابع مشابه
Pseudolinear Programming
This short note revisits an algorithm previously sketched by Mathis and Mathis, Siam Review 1995, and used to solve a nonlinear hospital fee optimization problem. An analysis of the problem structure reveals how the Simplex algorithm, viewed under the correct light, can be the driving force behind a successful algorithm for a nonlinear problem. 1 A seemingly nonlinear program In a past Classroo...
متن کاملPseudolinear fuzzy mappings q
Two classes of fuzzy mappings, called pseudolinear and g-pseudolinear fuzzy mappings are introduced by relaxing the definitions of pseudo-convex and pseudo-invex fuzzy mappings. First, some characterizations of pseudolinear and g-pseudolinear fuzzy mappings are obtained. Then, characterizations of the solution sets of pseudolinear and g-pseudolinear fuzzy programs are derived.
متن کاملOn the Pseudolinear Crossing Number
4 A drawing of a graph is pseudolinear if there is a pseudoline arrangement such that 5 each pseudoline contains exactly one edge of the drawing. The pseudolinear crossing 6 number c̃r(G) of a graph G is the minimum number of pairwise crossings of edges in 7 a pseudolinear drawing of G. We establish several facts on the pseudolinear crossing 8 number, including its computational complexity and i...
متن کاملTheory of Optimizing Pseudolinear Performance Measures: Application to F-measure
State of the art classification algorithms are designed to minimize the misclassification error of the system, which is a linear function of the per-class false negatives and false positives. Nonetheless non-linear performance measures are widely used for the evaluation of learning algorithms. For example, F -measure is a commonly used non-linear performance measure in classification problems. ...
متن کاملCovering Spheres with Spheres
Given a sphere of radius r > 1 in the n-dimensional Euclidean space, we study the coverings of this sphere with unit spheres. Our goal is to design a covering of the lowest covering density, which defines the average number of unit spheres covering a point in a bigger sphere. For growing n, we obtain the covering density of (n lnn)/2. This new upper bound is half the order n lnn established in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Michigan Mathematical Journal
سال: 1978
ISSN: 0026-2285
DOI: 10.1307/mmj/1029002117